A Sequentially Consistent Distributed Shared Memory
نویسندگان
چکیده
Recently, distributed shared memory (DSM) systems have received much attention because such an abstraction simpliies programming. An important class of DSM implementations is one which uses cache memories to improve eeciency. In this paper, we present a cache-consistency protocol for DSM which requires signiicantly less communication than previously proposed protocols. This is achieved by maintaining one bit of state information for each cache object in the system. We prove that the protocol satisses a formulation of sequential consistency.
منابع مشابه
A Fault-Tolerant Sequentially Consistent DSM with a Compositional Correctness Proof
We present the SC-ABD algorithm that implements sequentially consistent distributed shared memory (DSM). The algorithm tolerates that less than half of the processes are faulty (crash-stop). Compared to the multi-writer ABD algorithm, SC-ABD requires one instead of two round-trips of communication to perform a write operation, and an equal number of round-trips (two) to perform a read operation...
متن کاملThe Relative Importance of Concurrent Writers and Weak Consistency Models
This paper presents a detailed comparison of the relative importance of allowing concurrent writers versus the choice of the underlying consistency model. Our comparison is based on singleand multiple-writerversions of a lazy release consistent (LRC) protocol, and a single-writer sequentially consistent protocol, all implemented in the CVM software distributed shared memory system. We find that...
متن کاملThe Relative Importance
This paper presents a detailed comparison of the relative importance of allowing concurrent writers versus the choice of the underlying consistency model. Our comparison is based on single-and multiple-writer versions of a lazy release consistent (LRC) protocol, and a single-writer sequentially consistent protocol, all implemented in the CVM software distributed shared memory system. We nd that...
متن کاملReduced Overhead Logging for Rollback Recovery in Distributed Shared Memory
Rollback techniques that use message logging and deterministic replay can be used in parallel systems to recover a failed node without involving other nodes. Distributed shared memory (DSM) systems cannot directly apply message-passing logging techniques because they use inherently nondeterministic asynchronous communication. This paper presents new logging schemes that reduce the typically hig...
متن کاملEvaluation of Causal Distributed Shared Memory for Data-race-free Programs
Distributed Shared Memory (DSM) is becoming an accepted abstraction for programming distributed systems. Although DSM could simplify the programming of distributed applications, maintaining a consistent view of shared memory operations across processors in a distributed system can be expensive. The causal consistency model of DSM can allow more eecient implementations of DSM because it requires...
متن کامل